Low- Power Split-radix Fft Processors Using Carry Select

نویسندگان

  • G. Renuka
  • Aarthi Chandran
چکیده

Split-Radix Fast Fourier Transform (SRFFT) is mainly for the implementation of a low-power FFT processor. In FFT algorithms, SRFFT has less number of arithmetic operations. Twiddle factor is required in FFT addressing processors. The signal flow graph of SRFFT is the same as radix-2 FFT and so conventional addressing schemes is used in of SRFFT. However, it has improper arrangement of twiddle factors and denies application of radix-2 address generation methods.This brief presents a shared-memory low-power SRFFT processor architecture. We show that SRFFT can be computed by using a butterfly unit. The butterfly unit exploits the multiplier-gating technique to save dynamic power. In addition, two novel address generation algorithm for both trivial and non-trivial twiddle factors are developed. The proposed design achieves over a less delay, higher speed and 20% dynamic low power consumption. Keyword: SRFFT, Twiddle factor, Butterfly unit, etc....

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low - Power Split - Radix Fft Processors

To design a split radix fast Fourier transform is an ideal person for the implementing of a low-power FFT processor, because it has the lowest number of arithmetic operations among all the FFT algorithms. In the design of such processor, an efficient addressing scheme for FFT data as well as twiddle factors is required. The signal flow of SRFFT is the same as a redix-2 FF, and conventional addr...

متن کامل

A radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method

A radix-16 fast Fourier transform (FFT) algorithm suitable for multiply-add instruction is proposed. The proposed radix-16 FFT algorithm requires fewer floating-point instructions than the conventional radix-16 FFT algorithm on processors that have a multiplyadd instruction. Moreover, this algorithm has the advantage of fewer loads and stores than either the radix-2, 4 and 8 FFT algorithms or t...

متن کامل

High-speed and low-power split-radix FFT

This paper presents a novel split-radix fast Fourier transform (SRFFT) pipeline architecture design. A mapping methodology has been developed to obtain regular and modular pipeline for split-radix algorithm. The pipeline is repartitioned to balance the latency between complex multiplication and butterfly operation by using carry-save addition. The number of complex multiplier is minimized via a...

متن کامل

Efficient Radix-4 and Radix-8 Butterfly Elements

FFT/IFFT has been one of the most important algorithms in digital signal processing. In the recent years, the FFT/IFFT has frequently been applied in the modern communication systems due to its efficiency for OFDM (Orthogonal Frequency Division Multiplex) implementation. Many applications, like xDSL modems, HDTV, mobile radio terminals, use FFT/IFFT processor as a key component. The butterfly e...

متن کامل

A Study on High Performance Split Radix FFT

43  Abstract— A high performance hardware FFT have numerous application in instrumentation and communication systems. It describes new parallel FFT architecture which combines the split-radix algorithm with a constant geometry interconnect structure. The split-radix algorithm knows to have lower multiplicative complexity than both radix-2 as well as radix-4 algorithm. The split-radix algorithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017